From state distinguishability to effective bulk locality
نویسندگان
چکیده
منابع مشابه
From Absolute Distinguishability to Positive Distinguishability
We study methods of converting algorithms that distinguish pairs of distributions with a gap that has an absolute value that is noticeable into corresponding algorithms in which the gap is always positive (and noticeable). Our focus is on designing algorithms that, in addition to the tested string, obtain a fixed number of samples from each distribution. Needless to say, such algorithms can not...
متن کاملComparisons between quantum state distinguishability measures
We provide a compendium of inequalities between several quantum state distinguishability measures. For each measure these inequalities consist of the sharpest possible upper and lower bounds in terms of another measure. Some of these inequalities are already known, but new or more general proofs are given, whereas other inequalities are new. We also supply cases of equality to show that all ine...
متن کاملBulk Locality and Boundary Creating Operators
We formulate a minimum requirement for CFT operators to be localized in the dual AdS. In any spacetime dimensions, we show that a general solution to the requirement is a linear superposition of operators creating spherical boundaries in CFT, with the dilatation by the imaginary unit from their centers. This generalizes the recent proposal by Miyaji et al. for bulk local operators in the three ...
متن کاملAssessment of Awareness and Adaptation to Climate Change among Rainfed Farmers in Um Alqora Locality, Gezira State, Sudan
Climate change represents the major challenge to Sudan agricultural production, economics and food security. Changes in temperature, rainfalls, water availability, increased outbreak of pest and diseases, land degradation, soil erosion, shrinking of grazing and cultivate areas, ongoing desertification and the other aspects of climate change have direct significant impact on agricultural product...
متن کاملQuantum state and circuit distinguishability with single-qubit measurements
Abstract We show that the Quantum State Distinguishability (QSD), which is a QSZK-complete problem, and the Quantum Circuit Distinguishability (QCD), which is a QIP-complete problem, can be solved by the verifier who can perform only single-qubit measurements. To show these results, we use measurement-based quantum computing: the honest prover sends a graph state to the verifier, and the verifi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2014
ISSN: 1029-8479
DOI: 10.1007/jhep06(2014)038